A Register Allocation Technique Using Register Existence Graph
نویسندگان
چکیده
Optamzztng compalataon as very amportant f o r generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon technaques 1s regaster allocataon. In regaster allocataon that takes account of anstructaonlevel parallelasm, anta-dependences generated when the same regaster as allocated to dafferent varaables, and spall code generated when the number of regasters as ansuflczent should be handled an such a way that the parallelasm an a program as not lost. In our method, we realazed regaster allocatzon usang a new data structure called the regzster exzstence graph, an whzch the parallelasm zn a program as well expressed.
منابع مشابه
What’s Wrong with Graph Coloring?
Graph coloring is the de facto standard technique for register allocation within a compiler. In this paper we examine the intuition that a better coloring algorithm results in better register allocation. By replacing the coloring phase of the gcc compiler’s register allocator with an optimal coloring algorithm, we demonstrate both the importance of extending the graph coloring model to better e...
متن کاملRegister allocation sensitive region scheduling
Because of the interdependences between instruction scheduling and register allocation, it is not clear which of these two phases should run rst. In this paper, we describe how we modiied a global instruction scheduling technique to make it cooperate with a subsequent register allocation phase. In particular, our cooperative global instruction scheduler performs region scheduling transformation...
متن کاملRegister Allocation via Weighted Graph Coloring (Technical Summary)
Register allocation by coloring an interference graph is a common technique. We introduce the weighted interference graph (WIG) which improves upon previous approaches in the following ways: (i) the cost of a coloring accurately models the cost of the register assignment, (ii) arbitrary register spills are handled naturally, as the coloring implicitly determines when and what registers to spill...
متن کاملAn Analysis of Graph Coloring Register Allocation
Graph coloring is the de facto standard technique for register allocation within a compiler. In this paper we examine the importance of the quality of the coloring algorithm and various extensions of the basic graph coloring technique by replacing the coloring phase of the GNU compiler’s register allocator with an optimal coloring algorithm. We then extend this optimal algorithm to incorporate ...
متن کاملRegister Allocation for Software Pipelining with Predication using Spiral Graph
In this paper authors present Predicated Spiral Graph and Predicated Short Bridge Algorithm, that allocate registers to software pipelined loops with predication under the rotating register architectures. When using predication to execute the conditional branches, two separate variables in the pipelined kernel may share one real register, even if these overlap. Authors extend Spiral Graph to mu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997